BRAIN: Backward reachability analysis with integersRYBINA, Tatiana; VORONKOV, Andrei.Lecture notes in computer science. 2002, pp 489-494, issn 0302-9743, isbn 3-540-44144-1, 6 p.Conference Paper

Reduced power automataSUTNER, Klaus.Lecture notes in computer science. 2003, pp 194-202, issn 0302-9743, isbn 3-540-40391-4, 9 p.Conference Paper

Characterization of reachable/nonreachable cellular automata statesDAS, Sukanta; SIKDAR, Biplab K; PAL CHAUDHURI, P et al.Lecture notes in computer science. 2004, pp 813-822, issn 0302-9743, isbn 3-540-23596-5, 10 p.Conference Paper

Infinity of intermediate states is decidable for Petri netsWIMMEL, Harro.Lecture notes in computer science. 2004, pp 426-434, issn 0302-9743, isbn 3-540-22236-7, 9 p.Conference Paper

Unification & sharing in timed automata verificationDAVID, Alexandre; BEHRMANN, Gerd; LARSEN, Kim G et al.Lecture notes in computer science. 2003, pp 225-229, issn 0302-9743, isbn 3-540-40117-2, 5 p.Conference Paper

Model predictive control of discrete-time hybrid systems with discrete inputsPOTOCNIK, B; MUSIC, G; ZUPANCIC, B et al.ISA transactions. 2005, Vol 44, Num 2, pp 199-211, issn 0019-0578, 13 p.Article

Validation de spécifications RT-LOTOS : Une interface vers l'outil TINA = RT-LOTOS specification validation: an interface to the TINA toolsSADANI, Tarek; DE SAQUI-SANNES, Pierre; COURTIAT, Jean-Pierre et al.Journal européen des systèmes automatisés. 2005, Vol 39, Num 1-3, pp 271-286, issn 1269-6935, 16 p.Conference Paper

Monitoring of Timed Discrete Events Systems With InterruptsALLAHHAM, Adib; ALLA, Hassane.IEEE transactions on automation science and engineering. 2010, Vol 7, Num 1, pp 146-150, issn 1545-5955, 5 p.Article

Complexity reduction through a Schur-based decomposition for reachability analysis of linear time-invariant systemsKAYNAMA, Shahab; OISHI, Meeko.International journal of control. 2011, Vol 84, Num 1-3, pp 165-179, issn 0020-7179, 15 p.Article

A necessary and sufficient condition for the liveness and reversibility of process- resource nets with acyclic, quasi-live, serializable, and reversible process subnetsREVELIOTIS, Spyros.IEEE transactions on automation science and engineering. 2006, Vol 3, Num 4, pp 462-468, issn 1545-5955, 7 p.Article

A reachability algorithm for general petri nets based on transition invariantsKOSTIN, Alexander E.Lecture notes in computer science. 2006, pp 608-621, issn 0302-9743, isbn 3-540-37791-3, 1Vol, 14 p.Conference Paper

Unbounded Petri net synthesisDARONDEAU, Philippe.Lectures on concurrency and Petri nets : advances in Petri nets. Lecture notes in computer science. 2004, pp 413-438, issn 0302-9743, isbn 3-540-22261-8, 26 p.Book Chapter

On abstraction in software verificationCOUSOT, Patrick; COUSOT, Radhia.Lecture notes in computer science. 2002, pp 37-56, issn 0302-9743, isbn 3-540-43997-8, 20 p.Conference Paper

Modeling the reachable sets for positive linear systems using self-regulating adaptive perceptron type neural networksRUMCHEV, Ventsi G; SWINIARSKI, Roman W.Proceedings of the American Control Conference. 2002, pp 4642-4647, issn 0743-1619, isbn 0-7803-7298-0, 6Vol, 6 p.Conference Paper

Checking cleanness in linked listsDOR, N; RODEH, M; SAGIV, M et al.Lecture notes in computer science. 2000, pp 115-134, issn 0302-9743, isbn 3-540-67668-6Conference Paper

Modelling and analysing the SDL description of the ISDN-DSS1 protocolHUSBERG, N; TYNJÄLÄ, T; VARPAANIEMI, K et al.Lecture notes in computer science. 2000, pp 244-260, issn 0302-9743, isbn 3-540-67693-7Conference Paper

Beyond region graphs : Symbolic forward analysis of timed automataMUKHOPADHYAY, S; PODELSKI, A.Lecture notes in computer science. 1999, pp 232-244, issn 0302-9743, isbn 3-540-66836-5Conference Paper

Interprocedural path profilingMELSKI, D; REPS, T.Lecture notes in computer science. 1999, pp 47-62, issn 0302-9743, isbn 3-540-65717-7Conference Paper

Some observations on the computational complexity of graph accessibility problemTARUI, J; TODA, S.Lecture notes in computer science. 1999, pp 18-30, issn 0302-9743, isbn 3-540-66200-6Conference Paper

A point-based POMDP algorithm for robot planningSPAAN, Matthijs T. J; VLASSIS, Nikos.IEEE International Conference on Robotics and Automation. 2004, pp 2399-2404, isbn 0-7803-8232-3, 5Vol, 6 p.Conference Paper

Abstract interpretation of game propertiesHENZINGER, T. A; MAJUMDAR, R; RASKIN, J.-F et al.Lecture notes in computer science. 2000, pp 220-239, issn 0302-9743, isbn 3-540-67668-6Conference Paper

A decidable logic for describing linked data structuresBENEDIKT, M; REPS, T; SAGIV, M et al.Lecture notes in computer science. 1999, pp 2-19, issn 0302-9743, isbn 3-540-65699-5Conference Paper

Decidable fragments of simultaneous rigid reachabilityCORTIER, V; GANZINGER, H; JACQUEMARD, F et al.Lecture notes in computer science. 1999, pp 250-260, issn 0302-9743, isbn 3-540-66224-3Conference Paper

An algorithm for the approximative analysis of rectangular automataPREUSSIG, J; KOWALEWSKI, S; WONG-TOI, H et al.Lecture notes in computer science. 1998, pp 228-240, issn 0302-9743, isbn 3-540-65003-2Conference Paper

Computing reachable control states of systems modeled with uninterpreted functions and infinite memoryISLES, A. J; HOJATI, R; BRAYTON, R. K et al.Lecture notes in computer science. 1998, pp 256-267, issn 0302-9743, isbn 3-540-64608-6Conference Paper